Solution to a problem of Sands on the factorization of groups

نویسنده

  • V. S. Prasad
چکیده

Using elementary methods, a positive answer is given to a question of A. D. Sands concerning factorizations of abelian groups. We then indicate how our approach to Sands’s question has its roots in a result on the ergodic theory of infinite measure preserving transformations due to Eigen, Hajian and Ito. 1. SANDS’S PROBLEM AND AN ELEMENTARY SOLUTION In [2], A.D. Sands notes that a positive answer to the following problem would simplify the proofs in [2]. Our Theorem 1.1 which is proved using elementary arguments, provides (as a special case) such a positive answer. Here is Sands’s problem: Problem(Sands). Suppose that G = A + B is a factorization of the group G, and that the subset A isjinite. Suppose that a subset C of G exists such that IAl = ICI and the sum of C and B is direct. Does it follow that G = C + B? The terminology from [2] is as follows: the “group” G is an additive abelian group; the cardinality of a set C is denoted 1 Cl; for subsets A, B of G their sum is A + B = {a + b : a E A, b E B}. When each element of A + B is expressed uniquely in this way, the sum is called direct and we write A + B = A $ B. A factorization of G, means that for some sets A and B, G = A 8 B. In this note, we write -A = {-a : a E A} and A A = A + (-A), the difiv-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triple factorization of non-abelian groups by two maximal subgroups

The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...

متن کامل

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

A social recommender system based on matrix factorization considering dynamics of user preferences

With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...

متن کامل

$n$-factorization Property of Bilinear Mappings

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...

متن کامل

آسیب‌پذیری سکونتگاه‌های روستایی از ماسه ‌های روان بستر خشک تالاب بین‌المللی هامون در شهرستان هیرمند

Every year, natural hazards happen severely around the world. Iran is included in the first 10 countries in the world susceptible to natural hazards, and has experienced 30 hazards out of total 35 hitherto. In this connection, moving sands, as a natural hazard, creates changes to ecological conditions which cause a rupture in the lives of people. The aforementioned hazards leave adverse effects...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003